Cryptanalysis of the Square Cryptosystems

نویسندگان

  • Olivier Billet
  • Gilles Macario-Rat
چکیده

Following the cryptanalyses of the encryption scheme HFE and of the signature scheme SFLASH, no serious alternative multivariate cryptosystems remained, except maybe the signature schemes UOV and HFE−−. Recently, two proposals have been made to build highly efficient multivariate cryptosystems around a quadratic internal transformation: the first one is a signature scheme called square-vinegar and the second one is an encryption scheme called square introduced at CT-RSA 2009. In this paper, we present a total break of both the square-vinegar signature scheme and the square encryption scheme. For the practical parameters proposed by the authors of these cryptosystems, the complexity of our attacks is about 2 operations. All the steps of the attack have been implemented in the Magma computer algebra system and allowed to experimentally assess the results presented in this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases

In this paper, we review and explain the existing algebraic cryptanalysis of multivariate cryptosystems from the hidden field equation (HFE) family. These cryptanalysis break cryptosystems in the HFE family by solving multivariate systems of equations. In this paper we present a new and efficient attack of this cryptosystem based on fast algorithms for computing Gröbner basis. In particular it ...

متن کامل

Cryptanalysis of a technique to transform discrete logarithm based cryptosystems into identity-based cryptosystems

In this paper we analyse a technique designed to transform any discrete logarithm based cryptosystem into an identity-based cryptosystem. The transformation method is claimed to be efficient and secure and to eliminate the need to invent new identity-based cryptosystems. However, we show that the identity-based cryptosystem created by the proposed transformation method suffers from a number of ...

متن کامل

Analysis of Different Cryptosystems Using Meta-heuristic Techniques

With the increasing usage of internet, the need of securing the information is also getting more important. The most widely used technique to make the information secure is cryptography. Cryptanalysis is a method to break the unreadable cipher text without having the key. This paper describes a method of deciphering encrypted messages of Vigenere cipher cryptosystems, Simple substitution crypto...

متن کامل

Application of Gray code to the cryptanalysis of chaotic cryptosystems

Gray codes have found many applications in engineering and mathematics. In this work we explain how to apply Gray codes to the determination of the control parameter and initial point of a chaotic orbit generated by the Mandelbrot map when the kneading sequence is known. Possible applications to the cryptanalysis of a certain type of cryptosystems based on Baptista’s algorithm are also discussed.

متن کامل

Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers

In this contribution instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems are formulated as optimization tasks. The performance of Evolutionary Computation methods on these tasks is studied for a representative Feistel cryptosystem, the Data Encryption Standard. The results indicate that the proposed methodology is efficient in handling this type of probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009